Approximation algorithms for partial covering problems*1

Approximation Algorithms for Partial Covering Problems

We study a generalization of covering problems called partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard covering problems. For example, in k-partial set cover, we wish to choose a minimum number of sets to cover at least k elements. For k-partial set cover, if each element occurs in at most f sets, then we derive a primal...

Approximation algorithms for covering/packing integer programs

Given matrices A and B and vectors a, b, c and d, all with non-negative entries, we consider the problem of computing min{cx : x ∈ Z+, Ax ≥ a, Bx ≤ b, x ≤ d}. We give a bicriteria-approximation algorithm that, given ε ∈ (0, 1], finds a solution of cost O(ln(m)/ε) times optimal, meeting the covering constraints (Ax ≥ a) and multiplicity constraints (x ≤ d), and satisfying Bx ≤ (1 + ε)b + β, wher...

Approximation algorithms for the covering Steiner problem

Approximation algorithms for partially covering with edges

The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or vertices, respectively, of a graph. We consider the generalized partial cover version of these problems, in which failing to cover an edge, in the EDS case, or vertex, in the EC case, induces a penalty. The objective is ...

Approximation of sets based on partial covering

Elméleti számítástudomány, adatvédelem és kriptográa programja keretében készítettem a Debreceni Egyetem doktori (PhD) fokozatának elnyerése céljából.zájárult. Az értekezés elfogadását javasolom.gadását javasolom. Értekezés a doktori (Ph.D.) fokozat megszerzése érdekében az informatika tudományágban. Írta: Csajbók Zoltán okleveles matematikus, matematika szakos középiskolai tanár. Készült a Deb...